Pii: S0167-2789(98)00051-7

Pii: S0167-2789(97)00262-5

Pii: S0167-2789(98)00168-7

We compare two algorithms for the numerical estimation of the correlation dimension from a finite set of vectors: the "classical" algorithm of Grassberger and Procaccia (GPA) and the recently proposed algorithm of Judd (JA). Data set size requirements and their relations to systematic and statistical errors of the estimates are investigated. It is demonstrated that correlation dimensions of the...

Phase-locking in weakly heterogeneous neuronal networks

We examine analytically the existence and stability of phase-locked states in a weakly heterogeneous neuronal network. We consider a model of N neurons with all-to-all synaptic coupling where the heterogeneity is in the firing frequency or intrinsic drive of the neurons. We consider both inhibitory and excitatory coupling. We derive the conditions under which stable phase-locking is possible. I...

Combined subdivision schemes for the design of surfaces satisfying boundary conditions

We present a new kind of subdivision schemes, which we call combined subdivision schemes. Such schemes are used to reene a given control net, taking into consideration boundary conditions on the limit surface. Several schemes are presented that generate limit surfaces interpolating given boundary curves and cross boundary derivatives. The interpolated boundary curves are arbitrary parametric cu...

Pii: S0167-2789(98)00047-5

A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly ef...